Construction of Periodic Counterexamples to the Discrete-Time Kalman Conjecture
نویسندگان
چکیده
This paper considers the Lurye system of a discrete-time, linear time-invariant plant in negative feedback with nonlinearity. Both monotone and slope-restricted nonlinearities are considered. The main result is procedure to construct destabilizing for system. If satisfies certain phase condition then nonlinearity can be constructed so that has non-trivial periodic cycle. Several examples provided demonstrate construction. represents contribution absolute stability analysis since provides less conservative upper bound than existing bounds literature.
منابع مشابه
Second-order counterexamples to the discrete-time Kalman conjecture
The Kalman conjecture is known to be true for third-order continuous-time systems. We show that it is false in general for second-order discrete-time systems by construction of counterexamples with stable periodic solutions. We discuss a class of second-order discrete-time systems for which it is true provided the nonlinearity is odd, but false in general. This has strong implications for the a...
متن کاملCounterexamples to the uniformity conjecture
The Exact Geometric Computing approach requires a zero test for numbers which are built up using standard operations starting with the natural numbers. The uniformity conjecture, part of an attempt to solve this problem, postulates a simple linear relationship between the syntactic length of expressions built up from the natural numbers using field operations, radicals and exponentials and loga...
متن کاملCounterexamples to Kalai's conjecture C
1 The First Counterexample Let ρ be a quantum state on the space (C) of n qudits (d-dimensional quantum systems). Denote by ρS the reduced state of ρ onto some subset S of the qudits. We partition S further into two nonempty subsets of qudits A and A := S\A (thus S must contain at least two qudits). Denote by Sep(A) the convex set of quantum states which are bipartite separable on S across the ...
متن کاملNew Counterexamples to Knaster’s Conjecture
Given a continuous map f : Sn−1 → Rm and n − m + 1 points p1, . . . , pn−m+1 ∈ Sn−1, does there exist a rotation % ∈ SO(n) such that f(%(p1)) = . . . = f(%(pn−m+1))? We give a negative answer to this question for m = 1 if n ∈ {61, 63, 65} or n ≥ 67 and for m = 2 if n ≥ 5.
متن کاملCounterexamples to the List Square Coloring Conjecture
A graph G is called chromatic-choosable if χl(G) = χ(G). It is an interesting problem to find graphs that are chromatic-choosable. There are several famous conjectures that some classes of graphs are chromatic-choosable including the List Coloring Conjecture, which states that any line graph is chromatic-choosable. The square G of a graph G is the graph defined on V (G) such that two vertices u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Control Systems Letters
سال: 2021
ISSN: ['2475-1456']
DOI: https://doi.org/10.1109/lcsys.2020.3033443